Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
نویسندگان
چکیده
منابع مشابه
Patterns in Eigenvalues: the 70th Josiah Willard Gibbs Lecture
Typical large unitary matrices show remarkable patterns in their eigenvalue distribution. These same patterns appear in telephone encryption, the zeros of Riemann’s zeta function, a variety of physics problems, and in the study of Toeplitz operators. This paper surveys these applications and what is currently known about the patterns.
متن کاملJosiah Willard Gibbs and the Extension of the Principles of Thermodynamics.
THE SCIENCE PRESS New York City: Grand Central Terminal. Lancaster, Pa. Garrison, N. Y. Annual Subscription, $6.oo. Single Copies, I5 Cts. SCIENCE Is the official organ of the American Association for the Advancement of Science. Information regarding membership in the Association may be secured from the office of the permanent secretary, in the Smithsonian Institution Building, Washington, D. C...
متن کاملRamifications, Old and New, of the Eigenvalue Problem
Since this is a lecture dedicated to the memory of Josiah Willard Gibbs let me start with that purely mathematical discovery which Gibbs contributed to the theory of Fourier series. Fourier series have to do with the eigenvalues and eigenfunctions of the oldest, simplest, and most important of all spectrum problems, that of the vibrating string. In preparing this lecture, the speaker has assume...
متن کاملLecture 8 : Eigenvalues and Eigenvectors
Hermitian Matrices It is simpler to begin with matrices with complex numbers. Let x = a + ib, where a, b are real numbers, and i = √ −1. Then, x∗ = a− ib is the complex conjugate of x. In the discussion below, all matrices and numbers are complex-valued unless stated otherwise. Let M be an n× n square matrix with complex entries. Then, λ is an eigenvalue of M if there is a non-zero vector ~v su...
متن کاملLecture 2: Eigenvalues and Expanders 2.1 Lecture Outline
There is a connection between the expansion of a graph and the eigengap (or spectral gap) of the normalized adjacency matrix (that is, the gap between the first and second largest eigenvalues). Recall that the largest eigenvalue of the normalized adjacency matrix is 1; denote it by λ1 and denote the second largest eigenvalue by λ2. We will see that a large gap (that is, small λ2) implies good e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 2003
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-03-00975-3